Orbifold E-functions of dual invertible polynomials
نویسندگان
چکیده
منابع مشابه
Orbifold Euler Characteristics for Dual Invertible Polynomials
To construct mirror symmetric Landau–Ginzburg models, P. Berglund, T. Hübsch and M. Henningson considered a pair (f, G) consisting of an invertible polynomial f and an abelian group G of its symmetries together with a dual pair (f̃ , G̃). Here we study the reduced orbifold Euler characteristics of the Milnor fibers of f and f̃ with the actions of the groups G and G̃ respectively and show that they ...
متن کاملMonodromy of Dual Invertible Polynomials
A generalization of Arnold’s strange duality to invertible polynomials in three variables by the first author and A. Takahashi includes the following relation. For some invertible polynomials f the Saito dual of the reduced monodromy zeta function of f coincides with a formal “root” of the reduced monodromy zeta function of its Berglund– Hübsch transpose f . Here we give a geometric interpretat...
متن کاملTutte polynomials of wheels via generating functions
We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.
متن کاملDual polynomials and communication complexity of $\textsf{XOR}$ functions
We show a new duality between the polynomial margin complexity of f and the discrepancy of the function f ◦XOR, called an XOR function. Using this duality, we develop polynomial based techniques for understanding the bounded error (BPP) and the weakly-unbounded error (PP) communication complexities of XOR functions. This enables us to show the following. • A weak form of an interesting conjectu...
متن کاملDual polynomials and communication complexity of XOR functions
We show a new duality between the polynomial margin complexity of f and the discrepancy of the function f ◦XOR, called an XOR function. Using this duality, we develop polynomial based techniques for understanding the bounded error (BPP) and the weakly-unbounded error (PP) communication complexities of XOR functions. This enables us to show the following. • A weak form of an interesting conjectu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Geometry and Physics
سال: 2016
ISSN: 0393-0440
DOI: 10.1016/j.geomphys.2016.03.026